Weierstrass method for quaternionic polynomial root-finding
نویسندگان
چکیده
منابع مشابه
The Amended DSeSC Power Method for Polynomial Root-Finding
Cardinal’s matrix version of the Sebastiao e Silva polynomial root-finder rapidly approximates the roots as the eigenvalues of the associated Frobenius matrix. We preserve rapid convergence to the roots but amend the algorithm to allow input polynomials with multiple roots and root clusters. As in Cardinal’s algorithm, we repeatedly square the Frobenius matrix in nearly linear arithmetic time p...
متن کاملRoot-finding and Root-refining for a Polynomial Equation
Polynomial root-finders usually consist of two stages. At first a crude approximation to a root is slowly computed; then it is much faster refined by means of the same or distinct iteration. The efficiency of computing an initial approximation resists formal study, and the users rely on empirical data. In contrast, the efficiency of refinement is formally measured by the classical concept q whe...
متن کاملPoint Estimation of Cubically Convergent Root Finding Method of Weierstrass’ Type
The aim of this paper is to state initial conditions for the safe and fast convergence of the simultaneous method of Weierstrass’ type for finding simple zeros of algebraic polynomial. This conditions are computationally verifiable and they depend only on the available data polynomial coefficients, its degree and initial approximations z 1 , . . . , z (0) n to the zeros. It is shown that under ...
متن کاملPolynomial Root-Finding Algorithms and Branched Covers
Introduction. The problem of devising optimal methods for numerically approximating the roots of a polynomial has been of interest for several centuries, and is far from solved. There are numerous recent works on root-finding algorithms and their cost, for example, the work of Jenkins and Traub [JT70], Renegar [Ren87], Schönhage [Sch82], and Shub and Smale [SS85, SS86, Sma85]. This list is far ...
متن کاملAccurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
In this paper we consider the application of polynomial root-finding methods to the solution of the tridiagonal matrix eigenproblem. All considered solvers are based on evaluating the Newton correction. We show that the use of scaled three-term recurrence relations complemented with error free transformations yields some compensated schemes which significantly improve the accuracy of computed r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods in the Applied Sciences
سال: 2017
ISSN: 0170-4214
DOI: 10.1002/mma.4623